Data Sharing Based on Error-Correcting Codes
نویسندگان
چکیده
منابع مشابه
Function Hiding Based on Error Correcting Codes
1. Supported by FCT grant PRAXIS XXI/BD/13875/97 Abstract This paper presents an original approach to the problem of function hiding based on Error Correcting Codes and evaluates the security of this approach. The novelty of the technique consists in using Error Correcting Codes to hide functions instead of encrypting data vectors. This protocol mainly deals with the issue of secure evaluation ...
متن کاملOne-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes
We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...
متن کاملLossless Data Compression with Error Correcting Codes
Existing zero-error variable-length data compression algorithms suffer from sensitivity to transmission errors and error propagation across packets when used in packet-based data transmission through noisy channels. We propose a new approach to lossless data compression based on error correcting codes and the block-sorting transform. It has long been recognized that linear source codes achieve ...
متن کاملNear-Optimal Secret Sharing and Error Correcting Codes in AC
We study the question of minimizing the computational complexity of (robust) secret sharing schemes and error correcting codes. In standard instances of these objects, both encoding and decoding involve linear algebra, and thus cannot be implemented in the class AC. The feasibility of non-trivial secret sharing schemes in AC was recently shown by Bogdanov et al. (Crypto 2016) and that of (local...
متن کاملLinear Multisecret-Sharing Schemes and Error-Correcting Codes
In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Computing Research
سال: 2017
ISSN: 2042-4655
DOI: 10.20533/ijicr.2042.4655.2017.0102